(σ-game, σ+-game and two-dimensional additive cellular automata
نویسندگان
چکیده
منابع مشابه
Minimum Light Numbers in the σ-Game and Lit-Only σ-Game on Unicyclic and Grid Graphs
Consider a graph each of whose vertices is either in the ON state or in the OFF state and call the resulting ordered bipartition into ON vertices and OFF vertices a configuration of the graph. A regular move at a vertex changes the states of the neighbors of that vertex and hence sends the current configuration to another one. A valid move is a regular move at an ON vertex. For any graph G, let...
متن کاملσ-Automata and Chebyshev-Polynomials
A σ-automaton is an additive, binary cellular automaton on a graph. For product graphs such as a grids and cylinders, reversibility and periodicity properties of the corresponding σautomaton can be expressed in terms of a binary version of Chebyshev polynomials. We will give a detailed analysis of the divisibility properties of these polynomials and apply our results to the study of σ-automata.
متن کاملΣ-null-additive Set Functions
There is introduced the notion of σ-null-additive set function as a generalization of the classical measure. There are proved the relations to disjoint and chain variations. The general Lebesgue decomposition theorem is obtained. AMS Mathematics Subject Classification (2000): 28A25
متن کاملSimulation and Evaluation of Urban Development Scenarios Using Integration of Cellular Automata Model and Game Theory
Urban growth is a dynamic and evolutionary spatial and social process that relates to the changes of urban spatial units and the transformation of people’s lifestyles and consequently demographic changes. Considering the urban development process as a function of land uses interactions, population structure and the strategic behavior of the agents involved in the urban development process (the ...
متن کاملTwo-Dimensional Cellular Automata
A largely phenomenological study of two-dimensional cellular automata is reported. Qualitative classes of behavior similar to those in one-dimensional cellular automata are found. Growth from simple seeds in two-dimensional cellular automata can produce patterns with complicated boundaries, characterized by a variety of growth dimensions. Evolutionfrom disordered states can give domains with bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00091-7